Power law dependence in a random differential equation
نویسندگان
چکیده
This paper studies a random differential equation with switch perturbations. We explore how the maximum displacement from equilibrium state depends on statistical properties of time series switches. show power law dependence between upper bound and frequency perturbation switches, slope is dependent specific distribution intervals switching times. result suggests quantitative connection modulation amplitude under
منابع مشابه
A solution of nonlinear fractional random differential equation via random fixed point technique
In this paper, we investigate a new type of random $F$-contraction and obtain a common random fixed point theorem for a pair of self stochastic mappings in a separable Banach space. The existence of a unique solution for nonlinear fractional random differential equation is proved under suitable conditions.
متن کاملPower-law random walks.
In this paper, random walks with independent steps distributed according to a Q-power-law probability distribution function with Q=1/(1-q) are studied. In the case q>1, we show that (i) a stochastic representation of the location of the walk after n steps can be explicitly given (for both finite and infinite variance) and (ii) a clear connection with the superstatistics framework can be establi...
متن کاملOn convergence of homotopy analysis method to solve the Schrodinger equation with a power law nonlinearity
In this paper, the homotopy analysis method (HAM) is considered to obtain the solution of the Schrodinger equation with a power law nonlinearity. For this purpose, a theorem is proved to show the convergence of the series solution obtained from the proposed method. Also, an example is solved to illustrate the eciency of the mentioned algorithm and the h-curve is plotted to determine the region ...
متن کاملLoglog distances in a power law random intersection graph
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant compon...
متن کاملLarge Cliques in a Power-law Random Graph
We study the size of the largest clique ω(G(n, α)) in a random graphG(n, α) on n vertices which has power-law degree distribution with exponent α. We show that for ‘flat’ degree sequences with α > 2 whp the largest clique in G(n, α) is of a constant size, while for the heavy tail distribution, when 0 < α < 2, ω(G(n, α)) grows as a power of n. Moreover, we show that a natural simple algorithm wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics B
سال: 2022
ISSN: ['0217-9792', '1793-6578']
DOI: https://doi.org/10.1142/s0217979223500406